Optimal Operation and Scheduling of Parallel Machines in Jobshop Environments
نویسندگان
چکیده
منابع مشابه
Optimal parallel machines scheduling with availability constraints
We address a generalization of the classical multiprocessor scheduling problem with non simultaneous machine availability times, release dates, and delivery times. We develop new lower and upper bounds as well as a branching strategy which is based on a representation of a schedule as a permutation of jobs. We show that embedding a semi-preemptive lower bound based on max-flow computations in a...
متن کاملFlexible flowshop scheduling with equal number of unrelated parallel machines
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
متن کاملbicriteria scheduling in hybrid flow shop with unrelated parallel machines
this study considers scheduling in hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. this problem does not study in the literature, so far. flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. after mode...
متن کاملJobshop Scheduling in a Shipyard
Jobshop scheduling is considered a standard problem to solve by means of Genetic Algorithms (GA) and a number of articles have been written about this subject [3]. In spite of this, only few applications of GA have been published [2] on real jobshop scheduling problems. Even though some applications may not be published for business related reasons, more practical applications seem necessary, i...
متن کاملflexible flowshop scheduling with equal number of unrelated parallel machines
this article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. the objective is to minimize the makespan for a given set of jobs in the system. this problem class is np-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. a number of test problems are randomly ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management of Sustainable Development
سال: 2018
ISSN: 2247-0220
DOI: 10.2478/msd-2019-0006